Reduction to Versal Deformations of Matrix Pencils and Matrix Pairs with Application to Control Theory

نویسندگان

  • M. I. García-Planas
  • Alexei A. Mailybaev
چکیده

Matrix pencils under the strict equivalence and matrix pairs under the state feedback equivalence are considered. It is known that a matrix pencil (or a matrix pair) smoothly dependent on parameters can be reduced locally to a special typically more simple form, called the versal deformation, by a smooth change of parameters and a strict equivalence (or feedback equivalence) transformation. We suggest an explicit recurrent procedure for finding the change of parameters and equivalence transformation in the reduction of a given family of matrix pencils (or matrix pairs) to the versal deformation. As an application, this procedure is applied to the analysis of the uncontrollability set in the space of parameters for a one-input linear dynamical system. Explicit formulae for a tangent plane to the uncontrollability set at its regular point and the perturbation of the uncontrollable mode are derived. A physical example is given and studied in detail.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations∗

We derive versal deformations of the Kronecker canonical form by deriving the tangent space and orthogonal bases for the normal space to the orbits of strictly equivalent matrix pencils. These deformations reveal the local perturbation theory of matrix pencils related to the Kronecker canonical form. We also obtain a new singular value bound for the distance to the orbits of less generic pencil...

متن کامل

A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part II: A Stratification-Enhanced Staircase Algorithm

Computing the Jordan form of a matrix or the Kronecker structure of a pencil is a well-known ill-posed problem. We propose that knowledge of the closure relations, i.e., the stratiication, of the orbits and bundles of the various forms may be applied in the staircase algorithm. Here we discuss and complete the mathematical theory of these relationships and show how they may be applied to the st...

متن کامل

Tools for Structured Matrix Computations: Stratifications and Coupled Sylvester Equations

Developing theory, algorithms, and software tools for analyzing matrix pencils whose matrices have various structures are contemporary research problems. Such matrices are often coming from discretizations of systems of differential-algebraic equations. Therefore preserving the structures in the simulations as well as during the analyses of the mathematical models typically means respecting the...

متن کامل

Three-Phase to Single-Phase Matrix Converters: New Topology Based on New Control Method

In this paper, a new topology is proposed for three-phase to single-phase matrix converters, where more voltage levels are produced in the output in comparison with the conventional topologies. In addition, a new control method based on minimum error between the generated and the desired output voltages is proposed for three-phase to single-phase matrix converters. In the proposed control metho...

متن کامل

Orbit Closures of Singular Matrix Pencils

Equivalence of matrix pencils (pairs of pq matrices over C) is given by the GL p GL q-action of simultaneous left and right multiplication. The orbits under this group action were described by Kronecker in 1890 in terms of pencil invariants: column indices, row indices, and elementary divisors. In this paper we describe the topological closures of these orbits, a problem motivated by our work i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2003